Zero sets of univariate polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero sets of univariate polynomials

Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...

متن کامل

Zero Sets of Polynomials in Several Variables

Let k, n ∈ IN, where n is odd. We show that there is an integer N = N(k, n) such that for every n-homogeneous polynomial P : IRN → IR there exists a linear subspace X ↪→ IRN , dimX = k such that P |X ≡ 0. This quantitative estimate improves on previous work of Birch, et al, who studied this problem from an algebraic viewpoint. The topological method of proof presented here also allows us to obt...

متن کامل

Zeros of univariate interval polynomials

Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros ...

متن کامل

Structure of Sets Which Are Well Approximated by Zero Sets of Harmonic Polynomials

The zero sets of harmonic polynomials play a crucial role in the study of the free boundary regularity problem for harmonic measure. In order to understand the fine structure of these free boundaries a detailed study of the singular points of these zero sets is required. In this paper we study how “degree k points” sit inside zero sets of harmonic polynomials in R of degree d (for all n ≥ 2 and...

متن کامل

Approximate Gcd of Inexact Univariate Polynomials

− The problem of finding the greatest common divisor (GCD) of univariate polynomials appears in many engineering fields. Despite its formulation is well-known, it is an ill-posed problem that entails numerous difficulties when the coefficients of the polynomials are not known with total accuracy, as, for example, when they come from measurement data. In this work we propose a novel GCD estimati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2010

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-2010-05086-x